On the Automatic Validation of Parameterized Unity Programs

Parameterized Veri cation with AutomaticallyComputed Inductive Assertions ?

The paper presents a method, called the method of verii-cation by invisible invariants, for the automatic veriication of a large class of parameterized systems. The method is based on the automatic calculation of candidate inductive assertions and checking for their induc-tiveness, using symbolic model-checking techniques for both tasks. First, we show how to use model-checking techniques over ...

Revising UNITY Programs: Possibilities and Limitations1

We concentrate on automatic addition of UNITY properties unless, stable, invariant, and leads-to to programs. We formally define the problem of adding UNITY properties to programs while preserving their existing properties. For cases where one simultaneously adds a single leads-to property along with a conjunction of unless, stable, and invariant properties to an existing program, we present a ...

Parameterized Systems : Generalizing and Simplifying Automatic Verification

Rezine, A. 2008. Parameterized Systems: Generalizing and Simplifying Automatic Verification. Acta Universitatis Upsaliensis. Uppsala Dissertations from the Faculty of Science and Technology 72. 196 pp. Uppsala. ISBN 978-91-554-7138-5. In this thesis we propose general and simple methods for automatic verification of parameterized systems. These are systems consisting of an arbitrary number of i...

Summation Theory II: Characterizations of $\boldsymbol{R\Pi\Sigma^*}$-extensions and algorithmic aspects

Recently, RΠΣ∗-extensions have been introduced which extend Karr’s ΠΣ∗-fields substantially: one can represent expressions not only in terms of transcendental sums and products, but one can work also with products over primitive roots of unity. Since one can solve the parameterized telescoping problem in such rings, covering as special cases the summation paradigms of telescoping and creative t...

Verification of parameterized programs